Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks

Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...

Analytical approximation of transient joint queue-length distributions within finite capacity Markovian queueing networks

This paper presents an analytical approximate and computationally tractable technique for the transient analysis of finite capacity Markovian networks. The approach is based on a network decomposition that is unique, it decomposes the network into overlapping (non-disjoint) subnetworks. The model approximates the transient queue-length distributions of the subnetworks. It is computationally tra...

Closed queueing networks with finite capacity queues: approximate analysis

Queueing networks with finite capacity queues and blocking are applied to model systems with finite resources and population constraints, such as computer and communication systems, as well as traffic, production and manufacturing systems. Various blocking types can be defined to represent different system behaviors. When a customer attempts to enter a full capacity queue blocking occurs. The a...

Bottlenecks in Markovian Queueing Networks

We will consider the problem of identifying regions of congestion in closed queueing networks with state-dependent service rates. A particular queue will be called a bottleneck if the number of customers in that queue grows without bound as the total number of customers in the network becomes large. We will review methods for identifying potential bottlenecks, with a view to controlling congest...

Modeling Finite Capacity Queueing Networks with Stochastic Automata Networks